1,815 research outputs found
Numerical Study of the Correspondence Between the Dissipative and Fixed Energy Abelian Sandpile Models
We consider the Abelian sandpile model (ASM) on the large square lattice with
a single dissipative site (sink). Particles are added by one per unit time at
random sites and the resulting density of particles is calculated as a function
of time. We observe different scenarios of evolution depending on the value of
initial uniform density (height) . During the first stage of the
evolution, the density of particles increases linearly. Reaching a critical
density , the system changes its behavior sharply and relaxes
exponentially to the stationary state of the ASM with . We found
numerically that and . Our
observations suggest that the equality holds for more general
initial conditions with non-positive heights. In parallel with the ASM, we
consider the conservative fixed-energy Abelian sandpile model (FES). The
extensive Monte-Carlo simulations for have confirmed that in the
limit of large lattices coincides with the threshold density
of FES. Therefore, can be identified with
if the FES starts its evolution with non-positive uniform height .Comment: 6 pages, 8 figure
The problem of predecessors on spanning trees
We consider the equiprobable distribution of spanning trees on the square
lattice. All bonds of each tree can be oriented uniquely with respect to an
arbitrary chosen site called the root. The problem of predecessors is finding
the probability that a path along the oriented bonds passes sequentially fixed
sites and . The conformal field theory for the Potts model predicts the
fractal dimension of the path to be 5/4. Using this result, we show that the
probability in the predecessors problem for two sites separated by large
distance decreases as . If sites and are
nearest neighbors on the square lattice, the probability can be
found from the analytical theory developed for the sandpile model. The known
equivalence between the loop erased random walk (LERW) and the directed path on
the spanning tree says that is the probability for the LERW started at
to reach the neighboring site . By analogy with the self-avoiding walk,
can be called the return probability. Extensive Monte-Carlo simulations
confirm the theoretical predictions.Comment: 7 pages, 2 figure
Green functions for the TASEP with sublattice parallel update
We consider the totally asymmetric simple exclusion process (TASEP) in
discrete time with the sublattice parallel dynamics describing particles moving
to the right on the one-dimensional infinite chain with equal hoping
probabilities. Using sequentially two mappings, we show that the model is
equivalent to the TASEP with the backward-ordered sequential update in the case
when particles start and finish their motion not simultaneously. The Green
functions are obtained exactly in a determinant form for different initial and
final conditions.Comment: 11 pages, 4 figure
Jamming probabilities for a vacancy in the dimer model
Following the recent proposal made by Bouttier et al [Phys. Rev. E 76, 041140
(2007)], we study analytically the mobility properties of a single vacancy in
the close-packed dimer model on the square lattice. Using the spanning web
representation, we find determinantal expressions for various observable
quantities. In the limiting case of large lattices, they can be reduced to the
calculation of Toeplitz determinants and minors thereof. The probability for
the vacancy to be strictly jammed and other diffusion characteristics are
computed exactly.Comment: 19 pages, 6 figure
- …